package com.fengye.algorithms.leecode.dp;

/**
 * @Author fengye
 * @Date 2023/5/14 9:28
 **/
public class MinCostClimbingStairs746 {
    public int minCostClimbingStairs(int[] cost) {
        int len = cost.length;

        int[] dp = new int[len+1];
        dp[0] = dp[1] = 0;
        for(int i = 2;i <= len;i++) {
            dp[i] = Math.min(dp[i-1] + cost[i-1], dp[i-2] + cost[i-2]);
        }
        return dp[len];
    }
}
